Building Hierarchical Classifiers Using Class Proximity
نویسندگان
چکیده
In this paper, we address the need to automatically classify text documents into topic hierarchies like those in ACM Digital Library and Yahoo!. The existing local approach constructs a classi er at each split of the topic hierarchy. However, the local approach does not address the closeness of classi cation in hierarchical classi cation where the concern often is how close a classi cation is, rather than simply correct or wrong. Also, the local approach puts its bet on classi cation at higher levels where the classi cation structure often diminishes. To address these issues, we propose the notion of class proximity and cast the hierarchical classi cation as a at classi cation with the class proximity modeling the closeness of classes. Our approach is global in that it constructs a single classi er based on the global informationabout all classes and class proximity. We leverage generalized association rules as the rule/feature space to address several other issues in hierarchical classi cation.
منابع مشابه
Building Hierarchical Classi ers Using Class Proximity
In this paper we address the need to auto matically classify text documents into topic hierarchies like those in ACM Digital Library and Yahoo The existing local approach con structs a classi er at each split of the topic hi erarchy However the local approach does not address the closeness of classi cation in hier archical classi cation where the concern often is how close a classi cation is ra...
متن کاملEnsembles of Proximity-Based One-Class Classifiers for Author Verification Notebook for PAN at CLEF 2014
We use ensembles of proximity based one-class classifiers for authorship verification task. The one-class classifiers compare, for each document of the known authorship, the dissimilarity between this document and the most dissimilar other document of this authorship to the dissimilarity between this document and the questioned document. As the dissimilarity measure between documents we use Com...
متن کاملUsing Proximity and Spatial Homogeneity in Neighbourhood-Based Classifiers
In this paper, a set of neighbourhood-based classifiers are jointly used in order to select a more reliable neighbourhood of a given sample and take an appropriate decision about its class membership. The approaches introduced here make use of two concepts: proximity and symmetric placement of the samples.
متن کاملRcmde-gsd: Building Global Hierarchical Classifiers Using Differential Evolution for Predicting Gene Ontology Terms
In this work, we present a method to the building of a global hierarchical classification of the proteins functions for a structure of classes represented by a DAG (Directed Acyclic Graph), called RCMDE-GSD (Rule Construction Method Using Differential Evolution-Global Single DAG). Here, we compare RCMDE-GSD with hAntMiner, a method based on ACO (Ant Colony Optimization) algorithm and with HLCS,...
متن کاملClassification Using Proximity Catch Digraphs (Technical Report)
We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its approximate minimum dominating set. CCCDs showed relatively good performance...
متن کامل